KBCV - Knuth-Bendix Completion Visualizer
نویسندگان
چکیده
This paper describes a tool for Knuth-Bendix completion. In its interactive mode the user only has to select the orientation of equations into rewrite rules; all other computations (including necessary termination checks) are performed internally. Apart from the interactive mode, the tool also provides a fully automatic mode. Moreover, the generation of (dis)proofs in equational logic is supported. Finally, the tool outputs proofs in a certifiable format.
منابع مشابه
KBCV 2.0 - Automatic Completion Experiments
This paper describes the automatic mode of the new version of the Knuth-Bendix Completion Visualizer. The internally used data structures have been overhauled and the performance was dramatically improved by introducing caching, parallelization, and termindexing in the computation of critical pairs and simplification. The new version is much faster and can complete three more systems.
متن کاملKnuth - Bendix Completion with Modern Termination Checking
KNUTH-BENDIX COMPLETION WITH MODERN TERMINATION CHECKING
متن کاملAbstract Reduction Systems and Idea of Knuth-Bendix Completion Algorithm
Reduction Systems and Idea of Knuth-Bendix Completion Algorithm Grzegorz Bancerek Association of Mizar Users Białystok, Poland Summary. Educational content for abstract reduction systems concerning reduction, convertibility, normal forms, divergence and convergence, ChurchRosser property, term rewriting systems, and the idea of the Knuth-Bendix Completion Algorithm. The theory is based on [1].
متن کاملFormalizing Knuth-Bendix Orders and Knuth-Bendix Completion
We present extensions of our Isabelle Formalization of Rewriting that cover two historically related concepts: the Knuth-Bendix order and the Knuth-Bendix completion procedure. The former, besides being the first development of its kind in a proof assistant, is based on a generalized version of the Knuth-Bendix order. We compare our version to variants from the literature and show all propertie...
متن کامل